Upper Tails in Random Regular Graphs
Benjamin Gunby (Harvard University)
07-Jan-2021, 02:00-03:00 (5 years ago)
Abstract: Fix a graph K. What is the probability that a sparse random regular graph contains many more copies of K than expected?
combinatorics
Audience: researchers in the topic
Comments: pw 030303
Series comments: Check scmscomb.github.io/ for more information
Export talk to